Biased compensation recursive least squares-based threshold algorithm for time-delay rational models via redundant rule
نویسندگان
چکیده
منابع مشابه
Splitting the recursive least-squares algorithm
Exponentially weighted recursive least-squares (RLS) algorithms are commonly used for fast adaptation. In many cases the input signals are continuous-time. Either a fully analog implementation of the RLS algorithm is applied or the input data are sampled by analog-to-digital (AD) converters to be processed digitally. Although a digital realization is usually the preferred choice, it becomes unf...
متن کاملImplementation Of Quadratic Rotation Decomposition Based Recursive Least Squares Algorithm
Quadratic Rotation decomposition (QRD) based recursive least squares (RLS) algorithm can be used in variety of communication applications and its low complexity implementation can be of interest. In this paper we have presented FPGA implementation of QRD based RLS algorithm using Coordinate Rotation by Digital Computer (CORDIC) operator. FPGA resource estimates along with actual implementation ...
متن کاملApplication of Recursive Least Squares to Efficient Blunder Detection in Linear Models
In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...
متن کاملHard Threshold Least Mean Squares Algorithm
This work presents a new variation of the commonly used Least Mean Squares Algorithm (LMS) for the identification of sparse signals with an a-priori known sparsity using a hard threshold operator in every iteration. It examines some useful properties of the algorithm and compares it with the traditional LMS and other sparsity aware variations of the same algorithm. It goes on to examine the app...
متن کاملH " Bounds for the Recursive - Least - Squares Algorithm *
We obtain upper and lower bounds for the H" norm of the RLS (Recursive-Least-Squares) algorithm. The H" norm may be regarded aa the worst-case energy gain from the disturbances to the prediction errors, and is therefore a measure of the robustness of an algorithm to perturbations and model uncertainty. Our results allow one to compare the robustness of RLS compared to the LMS (Least-Mean-Square...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Dynamics
سال: 2017
ISSN: 0924-090X,1573-269X
DOI: 10.1007/s11071-017-3910-6